Phone classification in pseudo-euclidean vector spaces
نویسندگان
چکیده
Recently we have proposed a structural framework for modelling speech, which is based on patterns of phonological distinctive features, a linguistically well-motivated alternative to standard vector-space acoustic models like HMMs. This framework gives considerable representational freedom by working with features that have explicit linguistic interpretation, but at the expense of the ability to apply the wide range of analytical decision algorithms available in vector spaces, restricting oneself to more computationally expensive and less-developed symbolic metric tools. In this paper we show that a dissimilarity-based distance-preserving transition from the original structural representation to a corresponding pseudo-Euclidean vector space is possible. Promising results of phone classification experiments conducted on the TIMIT database are reported.
منابع مشابه
From the Lorentz Transformation Group in Pseudo-Euclidean Spaces to Bi-gyrogroups
The Lorentz transformation of order $(m=1,n)$, $ninNb$, is the well-known Lorentz transformation of special relativity theory. It is a transformation of time-space coordinates of the pseudo-Euclidean space $Rb^{m=1,n}$ of one time dimension and $n$ space dimensions ($n=3$ in physical applications). A Lorentz transformation without rotations is called a {it boost}. Commonly, the ...
متن کاملCovariants, Joint Invariants and the Problem of Equivalence in the Invariant Theory of Killing Tensors Defined in Pseudo-riemannian Spaces of Constant Curvature
The invariant theory of Killing tensors (ITKT) is extended by introducing the new concepts of covariants and joint invariants of (product) vector spaces of Killing tensors defined in pseudo-Riemannian spaces of constant curvature. The covariants are employed to solve the problem of classification of the orthogonal coordinate webs generated by non-trivial Killing tensors of valence two defined i...
متن کاملOn kaleidoscopic pseudo-randomness of finite Euclidean graphs
In this paper we study the kaleidoscopic pseudo-randomness of finite Euclidean graphs using probabilistic methods. Roughly speaking, we show that sufficiently large subsets of d-dimensional vector spaces over finite fields contain every possible finite configurations.
متن کاملClassification of Spherical Lagrangian Submanifolds in Complex Euclidean Spaces
An isometric immersion f : Mn → M̃n from a Riemannian nmanifold Mn into a Kähler n-manifold M̃n is called Lagrangian if the complex structure J of the ambient manifold M̃n interchanges each tangent space of Mn with the corresponding normal space. In this paper, we completely classify spherical Lagrangian submanifolds in complex Euclidean spaces. In this paper, we also provide two corresponding cla...
متن کاملAngles in Complex Vector Spaces
The article reviews some of the (fairly scattered) information available in the mathematical literature on the subject of angles in complex vector spaces. The following angles and their relations are considered: Euclidean, complex, and Hermitian angles, (Kasner’s) pseudo-angle, the Kähler angle (synonyms for the latter used in the literature are: angle of inclination, characteristic deviation, ...
متن کامل